Formation and Management in Mobile Ad Hoc Networks

This article proposes a scenario-based algorithm for cluster formation and management in mobile ad hoc networks. Depending on the application a centralized or distributed algorithm based on (k, r) −Dominating Set is used for the selection of clusterheads and gateway nodes. Here k is the minimum number of clusterheads per node in the network and r is the maximum number of hops between the node and the clusterhead. The non-clusterhead node can select the most qualified dominating node as its clusterhead from among the k dominating nodes. The quality of the clusterhead is a function of various metrics, which include connectivity, stability and residual battery power. Long-term service as clusterhead depletes their energy, causing them to drop out of the network. Similarly, the clusterhead with relatively high mobility than its neighbors leads to frequent clusterhead election process. This perturbs the stability of the network and adversely affects the network performance. [Article copies are available for purchase from InfoScion-Demand.com]